Distance paired-domination problems on subclasses of chordal graphs
نویسندگان
چکیده
منابع مشابه
Distance paired domination numbers of graphs
In this paper, we study a generalization of the paired domination number. Let G= (V ,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a k-distance paired dominating set of G if D is a k-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The k-distance paired domination number p(G) is the cardinality of a smallest k-distance paired dominating set of G. ...
متن کاملOn the Distance Paired-Domination of Circulant Graphs
Let G = (V, E) be a graph without isolated vertices. A set D ⊆ V is a d-distance paired-dominating set of G if D is a d-distance dominating set of G and the induced subgraph 〈D〉 has a perfect matching. The minimum cardinality of a d-distance paired-dominating set for graph G is the d-distance paired-domination number, denoted by γd p(G). In this paper, we study the ddistance paired-domination n...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملComplexity of distance paired-domination problem in graphs
Suppose G = (V , E) is a simple graph and k is a fixed positive integer. A subset D ⊆ V is a distance k-dominating set of G if for every u ∈ V , there exists a vertex v ∈ D such that dG(u, v) ≤ k, where dG(u, v) is the distance between u and v in G. A set D ⊆ V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph G[D] contains a perfect matchin...
متن کاملEdge Contractions in Subclasses of Chordal Graphs
Modifying a given graph to obtain another graph is a wellstudied problem with applications in many fields. Given two input graphs G and H, the Contractibility problem is to decide whether H can be obtained from G by a sequence of edge contractions. This problem is known to be NP-complete already when both input graphs are trees of bounded diameter. We prove that Contractibility can be solved in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.08.005